Computing the Rao distance for Gamma distributions
نویسندگان
چکیده
منابع مشابه
Rao ’ S Distance for Negative Multinomial Distributions
SUMMARY. Rao (1945) proposed a method, based on Fisher's information matrix, for measuring distance between distributions of a parametric family satisfying certain regularity conditions. In this paper, Rao's (1945) method is applied to obtain the distance between two negative multinomial distributions. Some other properties are discussed too.
متن کاملOn bounds for the Fisher-Rao distance between multivariate normal distributions
Information geometry is approached here by considering the statistical model of multivariate normal distributions M as a Riemannian manifold with the natural metric provided by the Fisher information matrix. This differential geometric approach to probability theory, introduced by C. Rao in 1945, have been recently applied to different domains such as statistical inference, mathematical program...
متن کاملComputing the Kullback-Leibler Divergence between two Generalized Gamma Distributions
We derive a closed form solution for the Kullback-Leibler divergence between two generalized gamma distributions. These notes are meant as a reference and provide a guided tour towards a result of practical interest that is rarely explicated in the literature. 1 The Generalized Gamma Distribution The origins of the generalized gamma distribution can be traced back to work of Amoroso in 1925 [1,...
متن کاملComputing Weierstrass semigroups and the Feng-Rao distance from singular plane models
We present an algorithm to compute the Weierstrass semigroup at a point P together with functions for each value in the semigroup, provided P is the only branch at infinity of a singular plane model for the curve. As a byproduct, the method also provides us with a basis for the spaces L(mP ) and the computation of the Feng-Rao distance for the corresponding array of geometric Goppa codes. A gen...
متن کاملComputing Constrained Cramer Rao Bounds
We revisit the problem of computing submatrices of the Cramér-Rao bound (CRB), which lower bounds the variance of any unbiased estimator of a vector parameter θ. We explore iterative methods that avoid direct inversion of the Fisher information matrix, which can be computationally expensive when the dimension of θ is large. The computation of the bound is related to the quadratic matrix program...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Computational and Applied Mathematics
سال: 2003
ISSN: 0377-0427
DOI: 10.1016/s0377-0427(03)00387-x